A Fast Multi-Scale Method for Drawing Large Graphs
نویسندگان
چکیده
منابع مشابه
A Fast Multi-Dimensional Algorithm for Drawing Large Graphs
We present a novel hierarchical force-directed method for drawing large graphs. The algorithm produces a graph embedding in an Euclidean space E of any dimension. A two or three dimensional drawing of the graph is then obtained by projecting a higher-dimensional embedding into a two or three dimensional subspace of E. Projecting high-dimensional drawings onto two or three dimensions often resul...
متن کاملVLGD, Algorithm for Drawing Very Large Graphs
Given a large planar graph we want to display it in a meaningful fashion. We present VLGD: a new, straightforward and fast algorithm for automatic display of very large planar graphs. We recursively divide the graph in pieces of roughly equal size. As a result we get a collection of O(logn) layers, where n is the number of vertices in the graph. Each succeeding layer represents the graph in an ...
متن کاملAre Crossings Important for Drawing Large Graphs?
Abstract. Reducing the number of edge crossings is considered one of the most important graph drawing aesthetics. While real-world graphs tend to be large and dense, most of the earlier work on evaluating the impact of edge crossings utilizes relatively small graphs that are manually generated and manipulated. We study the effect on task performance of increased edge crossings in automatically ...
متن کاملSelf-Organizing Maps for Drawing Large Graphs
SFI WORKING PAPER: 1998-07-066 SFI Working Papers contain accounts of scientific work of the author(s) and do not necessarily represent the views of the Santa Fe Institute. We accept papers intended for publication in peer-reviewed journals or proceedings volumes, but not papers that have already appeared in print. Except for papers by our external faculty, papers must be based on work done at ...
متن کاملA fast, large-scale learning method for protein sequence classification
Motivation: Establishing structural and functional relationships between sequences in the presence of only the primary sequence information is a key task in biological sequence analysis. This ability can be critical for tasks such as making inferences of the structural class of unannotated proteins when no secondary or tertiary structure is available. Recent computational methods based on profi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Algorithms and Applications
سال: 2002
ISSN: 1526-1719
DOI: 10.7155/jgaa.00051